COMPLEXITY DEPS IN RANDOM INFINITE BINARY SEQUENCESKATSEFF HP.1978; INFORM. AND CONTROL; USA; DA. 1978; VOL. 38; NO 3; PP. 258-263; BIBL. 4 REF.Article

SEVERAL RESULTS IN PROGRAM SIZE COMPLEXITYKATSEFF HP; SIPSER M.1981; THEOR. COMPUT. SCI.; ISSN 0304-3975; NLD; DA. 1981; VOL. 15; NO 3; PP. 291-309; BIBL. 18 REF.Article

A 5/4 ALGORITHM FOR TWO-DIMENSIONAL PACKINGBAKER BS; BROWN DJ; KATSEFF HP et al.1981; J. ALGORITHMS; ISSN 0196-6774; USA; DA. 1981; VOL. 2; NO 4; PP. 348-368; BIBL. 4 REF.Article

LOWER BOUNDS FOR ON-LINE TWO-DIMENSIONAL PACKING ALGORITHMSBAKER BS; BROWN DJ; KATSEFF HP et al.1979; CONFERENCE ON INFORMATION SCIENCES AND SYSTEMS/1979-03-28/BALTIMORE MD; USA; BALTIMORE: THE JOHNS HOPKINS UNIVERSITY; DA. 1979; PP. 174-179; BIBL. 7 REF.Conference Paper